Minimax estimation of smooth densities in Wasserstein distance

نویسندگان

چکیده

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular many areas of statistics and machine learning. give first minimax-optimal rates for this problem general distances two classes densities: smooth densities [0,1]d bounded away from 0, sub-Gaussian lying Hölder class Cs, s∈(0,1). Unlike classical estimation, these depend whether question are below, even compactly supported case. Motivated by variational involving we also show how to construct discretely measures, suitable computational purposes, which achieve minimax rates. Our main technical tool an inequality giving nearly tight dual characterization terms Besov norms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimax Distribution Estimation in Wasserstein Distance

The Wasserstein metric is an important measure of distance between probability distributions, with several applications in machine learning, statistics, probability theory, and data analysis. In this paper, we upper and lower bound minimax rates for the problem of estimating a probability distribution underWasserstein loss, in terms of metric properties, such as covering and packing numbers, of...

متن کامل

Minimax estimation of the L1 distance

We consider the problem of estimating the L1 distance between two discrete probability measures P and Q from empirical data in a nonasymptotic and large alphabet setting. When Q is known and one obtains n samples from P , we show that for every Q, the minimax rate-optimal estimator with n samples achieves performance comparable to that of the maximum likelihood estimator (MLE) with n lnn sample...

متن کامل

Estimation of deformations between distributions by minimal Wasserstein distance

We consider the issue of estimating a measure observed in a deformation framework. For this we consider a parametric deformation model on an empirical sample and provide a new matching criterion for cloud points based on a generalization of the registration criterion used in [15]. We study the asymptotic behaviour of the estimators of the deformations and provide some examples to some particula...

متن کامل

Sliced Wasserstein Barycenter of Multiple Densities

The optimal mass transportation problem provides a framework for interpolating between different probability density functions (pdfs), warping one function toward another. Interpolating between two arbitrary pdfs can be challenging, but interpolating between more than two pdfs just remains untractable. We propose an approximation of such interpolations based on 1D projections, that is efficient...

متن کامل

Wasserstein Distance Measure Machines

This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework extends the theory of similarity of Balcan et al. (2008) to the population distri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Statistics

سال: 2022

ISSN: ['0090-5364', '2168-8966']

DOI: https://doi.org/10.1214/21-aos2161